Updating Directed Minimum Cost Spanning Trees
نویسندگان
چکیده
We consider the problem of updating a directed minimum cost spanning tree (DMST), when edges are deleted from or inserted to a weighted directed graph. This problem apart from being a classic for directed graphs, is to the best of our knowledge a wide open aspect for the field of dynamic graph algorithms. Our contributions include results on the hardness of updates, a dynamic algorithm for updating a DMST, and detailed experimental analysis of the proposed algorithm exhibiting a speedup factor of at least 2 in comparison with the static practice.
منابع مشابه
An Algorithm for Enumerating all Directed Spanning Trees in a Directed Graph
A directed spanning tree in a directed graph G = (V,A) is a spanning tree such that no two arcs share their tails. In this paper, we propose an algorithm for listing all directed spanning trees of G. Its time and space complexities are O(|A| + ND(|V |, |A|)) and O(|A|+DS(|V |, |A|)), where D(|V |, |A|) and DS(|V |, |A|) are the time and space complexities of the data structure for updating the ...
متن کاملData Structures for On-Line Updating of Minimum Spanning Trees, with Applications
Data structures are presented for the problem of maintaining a. minimum spanning tree on-line under the operation of updating the cost of some edge in the graph. For the case of a general graph, maintaining the data structure and updating the tree are shown to take O(vm) time. where m is the number of edges in the graph. For the case of a planar graph, a data structure is presented which suppor...
متن کاملLecture notes on “ Analysis of Algorithms ” : Directed Minimum Spanning Trees ( More complete but still unfinished ) Lecturer : Uri Zwick
We describe an efficient implementation of Edmonds’ algorithm for finding minimum directed spanning trees in directed graphs. 1 Minimum Directed Spanning Trees Let G = (V,E,w) be a weighted directed graph, where w : E → R is a cost (or weight) function defined on its edges. Let r ∈ V . A directed spanning tree (DST) of G rooted at r, is a subgraph T of G such that the undirected version of T is...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملFood web networks: Scaling relation revisited
Food webs seem to possess scale invariant attributes among which efficiency has been recently included. Considering food webs as transportation networks it has been shown that minimum spanning trees, topologies that minimize cost for delivering medium, satisfy a universal scaling relation. It is not clear, however, whether resource distribution follows the criterion of minimum cost, because lon...
متن کامل